Walks on Weighted Graphs
نویسنده
چکیده
We now define random walks on weighted graphs. We will let A denote the adjacency matrix of a weighted graph. We will also the graph to have self-loops, which will correspond to diagonal entries in A. Thus, the only restriction on A is that is be symmetric and non-negative. When our random walk is at a vertex u, it will go to node v with probability proportional to au,v: mu,v def = au,v ∑ w au,w .
منابع مشابه
Interlacings for Random Walks on Weighted Graphs and the Interchange Process
Abstract. We study Aldous’ conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this inequality implies Aldous’ conjecture by combining an interlacing result for Laplacians of random walks on weighted graphs with representation theo...
متن کاملRandom walks pertaining to a class of deterministic weighted graphs
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
متن کاملThe Type Problem: Effective Resistance and Random Walks on Graphs
The question of recurrence or transience – the so-called type problem – is a central one in the theory of random walks. We consider edgeweighted random walks on locally finite graphs. The effective resistance of such weighted graphs is defined electrically and shown to be infinite if and only if the weighted graph is recurrent. We then introduce the Moore-Penrose pseudoinverse of the Laplacian ...
متن کاملCharacterization of the Critical Values of Branching Random Walks on Weighted Graphs through Infinite-type Branching Processes
We study the branching random walk on weighted graphs; site-breeding and edgebreeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locall...
متن کاملRandom walks on graphs with volume and time doubling∗
This paper studies the onand off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
متن کامل